Dynamic Load Distribution on Meshes with Broadcastingy

The mesh is a popular multi-computer topology due to its simplicity and need for few connections, regardless of the size of the system. However, one-to-all (broadcasting) or point-to-point communication between two nodes far away result in a long delay. In this paper, we propose a mesh with a global bus as a multi-computer topology. This structure enhances the communication capability of the mesh and shows that the mesh with a global bus has more salient properties than the mesh, the hypercube, or other variants. These properties includes a small diameter, a relatively small degree, small average distance, suitability for broadcasting, small initial data distribution time, etc. We propose a dynamic load distribution algorithm to utilize the enhanced communication capability of the mesh with a global bus. Also, asynchronous bus control and arbitration logics are designed to support the proposed algorithm eeciently. It has been shown through simulation that the proposed dynamic load distribution is superior to the Receiver Initiated Diiusion method, previously known as the best to-date. The proposed algorithm shows better total task execution time and better processor utilization with a smaller number of task migrations.